On the linear structure of symmetric Boolean functions
نویسندگان
چکیده
It is shown in this paper that nonlinear symmetric Boolean functions have no linear structures other than the all-zero and the all-one vectors. For such functions with n variables, it is shown that when n is odd, every such symmetric Boolean function is either a function with the all-one vector as an invariant linear structure or can be written as the product of two symmetric functions of which one has the all-one vector as an invariant linear structure and the other has the all-one vector as a complementary linear structure. In the case when n is even, it is shown that only 21-+1 of the symmetric Boolean functions have the all-one vector as an invariant linear structure and none has the all-one vector as a complementary linear structure.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملLinear Representation of Symmetric Games
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the symmetry, described as the action of symmetric group on payoff functions, is converted into the product of permutation matrices with structure vectors of payoff ...
متن کاملAlgebraic Structure of Classes of Nonlinear Filters
ABSTRACT In this research paper, it is shown that the class of all Boolean rank order filters are represented using the class of all Positive Symmetric Boolean functions. Using this result, it is shown that the class of all permutation invariant filters are equivalent to the class of rank order filters. The algebraic structure of Positive Boolean symmetric functions and Positive Boolean functio...
متن کاملCombinatorial method of polynomial expansion of symmetric Boolean functions
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean functions, while the complexity of the known methods for this class of functions is quadratic. The proposed method is based on the consequence of the combinatorial L...
متن کاملLinear Recurrences and Asymptotic Behavior of Exponential Sums of Symmetric Boolean Functions
In this paper we give an improvement of the degree of the homogeneous linear recurrence with integer coefficients that exponential sums of symmetric Boolean functions satisfy. This improvement is tight. We also compute the asymptotic behavior of symmetric Boolean functions and provide a formula that allows us to determine if a symmetric boolean function is asymptotically not balanced. In partic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 16 شماره
صفحات -
تاریخ انتشار 1997